A Compact Encoding of Sequential ASMs in Event-B
نویسندگان
چکیده
We present a translation of sequential ASMs to Event-B specifications. The translation also addresses the partial update problem, and allows a variable to be updated (consistently) in parallel. On the theoretical side, the translation highlights the intricacies of ASM rule execution in terms of Event-B semantics. On the practical side, we show on a series of examples that the Event-B encoding remains compact and is amenable to proof within Rodin as well as animation and model checking using ProB.
منابع مشابه
On the Expressive Power of Unbounded-Nondeterministic Abstract State Machines
Conventional computational models assume a symbolical representation of states. Gurevich’s Abstract State Machines (ASMs) take a more liberal position: any mathematical structure may serve as a state. In [7] Gurevich characterizes the expressive power of sequential ASMs: he defines the class of sequential algorithms by help of only a few, amazingly general requirements and proves this class to ...
متن کاملModeling the Dynamics of UML State Machines
We define the dynamic semantics of UML State Machines which integrate statecharts with the UML object model. The use of ASMs allows us (a) to rigorously model the event driven run to completion scheme, including the sequential execution of entry/exit actions (along the structure of state nesting) and the concurrent execution of internal activities; (b) to formalize the object interaction, by co...
متن کاملA Relational Encoding for a Clash-Free Subset of ASMs
This paper defines a static check for clash-freedom of ASM rules, including sequential and parallel composition, nondeterministic choice, and recursion. The check computes a formula that, if provable, makes a relational encoding of ASM rules possible, which is an important prerequisite for efficient deduction. The check is general enough to cover all sequential rules as well as many typical use...
متن کاملA Semantic Characterization of Elementary Wide-Step ASMs
Abstract State Machines (ASMs) describe their behavior by a simple, yet expressive program syntax. While such syntax is useful for the application of ASMs as a modeling and specification language, it often complicates theoretical considerations. Gurevich solved this problem for the class of sequential small-step ASMs by proposing an elegant semantic axiomatization for this class. Later, Blass a...
متن کاملDistributed Abstract State Machines and Their Expressive Power
State Machines have been introduced as a “computation model that is more powerful and more universal than the standard computation models” by Yuri Gurevich in 1985 [11]. This is achieved by adopting classical concepts from logics and universal algebra, and their conservative extension to describe sequential steps. A number of variants of ASMs evolved over time, in particular parallel, distribut...
متن کامل